An Alternating Binary-tree Partitioning for Fractal Image Coding

The fractal coding algorithm partitions the original image into a number of blocks. Then each block is coded by obtaining the information of the contractive transformations for the block. There are many methods of partitioning an image based on squares and rectangles such as xed-size partitioning, quad-tree partitioning, and HV partitioning. In this paper, we propose an alternating binary-tree partitioning (ABP) for fractal image coding. We repeat the partitioning rectangular blocks into square blocks and square blocks into rectangular blocks. This is an e cient scheme to implement the dedicated architecture for fractal image coding because it gives better compression and has regular partitioning scheme. Our experiments with ABP shows the increase of roughly 0.5 dB in PSNR which is better performances than quad-tree partitioning for Lenna, Boat, Peppers, and Girl images.